An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
نویسندگان
چکیده
منابع مشابه
Finding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graphG is modelled as follows. Every edge is included independently with probability d n , where d is some sufficiently large constant. Thereafter, for some constant α, a subset I of αn vertices is chosen at random, and all edges within this subset are removed. In this model, the planted independent set I...
متن کاملAn Algorithm for the Feedback Vertex Set Problem on a Normal Helly Circular-Arc Graph
The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit design, synchronous systems, computer systems, and very-large-scale integration (VLSI) circuits. The FVS problem is known to be NP-hard for simple graphs, but polynomial-time algorithm...
متن کاملAn algorithm for finding a maximum clique in a graph
This paper introduces a branch and bound algorithm for the maximumclique problem which applies existing clique nding and vertex coloring heuristics to determine lower and upper bounds for the size of a maximum clique. Computational results on a variety of graphs indicate the proposed procedure in most instances outperforms leading algorithms. and an anonymous referee for their helpful discussio...
متن کاملAn Optimal Algorithm to Find Maximum Independent Set and Maximum 2-Independent Set on Cactus Graphs
A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to find a maximum independent set and maximum 2-independent set on cactus graphs in O(n) time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.
متن کاملTabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph
A technique for finding in a graph an independent set with maximum cardinality is presented. It consists of an impiicit enumeration procedure; the procedure uses at various stages bounds on the inde~ndence number of a subgraph. These are obtained by applying an adaptation of Tabu Search. Computational results are given which show that with Tabu Search a competitive algorithm is obtained; the ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1988
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0217003